Generalized reliability bounds for coherent structures
نویسندگان
چکیده
منابع مشابه
Generalized Reliability Bounds for Coherent Structures
In this article we introduce generalizations of several well known reliability bounds. These bounds are based on arbitrary partitions of the family of minimal path or cut sets of the system and can be used for approximating the reliability of any coherent structure with iid components. An illustration is also given of how the general results can be applied for a specific reliability structure (...
متن کاملBounds for reliability of IFRA coherent systems using signatures
The reliability of any coherent system is the probability that it completes a mission of time t without failure. To calculate it one needs to know the structure function of the system and the distribution of the component life times which we assume to be independent and identically distributed continuous positive valued random variables. In this paper we bring together (i) the single crossing p...
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملOn Generalized Weak Structures
Avila and Molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α(g),π(g),σ(g) and β(g). This work is a further investigation of generalized weak structures due to Avila and Molina. Further we introduce the structures ro(g) and rc(g) and study the properties of the structures r...
متن کاملBounds for Generalized Thrackles
A thrackle (resp. generalized thrackle) is a drawing of a graph in which each pair of edges meets precisely once (resp. an odd number of times). For a graph with n vertices and m edges, we show that, for drawings in the plane, m ≤ 32 (n− 1) for thrackles, while m ≤ 2n − 2 for generalized thrackles. This improves theorems of Lovász, Pach, and Szegedy. The paper also examines thrackles in the mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2000
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200015990